Image Segmentation Using Information Bottleneck Method
نویسندگان
چکیده
منابع مشابه
A Modified Approach for Image Segmentation in Information Bottleneck Method
Image processing is a form of signal processing. One of the typical operations on image processing is image segmentation. In this paper, we use new image segmentation algorithms based on information bottleneck method. Here we are going to use three algorithms; first we introduce the split-and-merge algorithm, where an image is segmented into set of regions (input) and the intensity histogram bi...
متن کاملRegistration-Based Segmentation Using the Information Bottleneck Method
We present two new clustering algorithms for medical image segmentation based on the multimodal image registration and the information bottleneck method. In these algorithms, the histogram bins of two registered multimodal 3D-images are clustered by minimizing the loss of mutual information between them. Thus, the clustering of histogram bins is driven by the preservation of the shared informat...
متن کاملUnsupervised Image Clustering Using the Information Bottleneck Method
A new method for unsupervised image category clustering is presented, based on a continuous version of a recently introduced information theoretic principle, the information bottleneck (IB). The clustering method is based on hierarchical grouping: Utilizing a Gaussian mixture model, each image in a given archive is first represented as a set of coherent regions in a selected feature space. Imag...
متن کاملInformation Bottleneck Inspired Method For Chat Text Segmentation
We present a novel technique for segmenting chat conversations using the information bottleneck method (Tishby et al., 2000), augmented with sequential continuity constraints. Furthermore, we utilize critical non-textual clues such as time between two consecutive posts and people mentions within the posts. To ascertain the effectiveness of the proposed method, we have collected data from public...
متن کاملGeometric Clustering Using the Information Bottleneck Method
We argue that K–means and deterministic annealing algorithms for geometric clustering can be derived from the more general Information Bottleneck approach. If we cluster the identities of data points to preserve information about their location, the set of optimal solutions is massively degenerate. But if we treat the equations that define the optimal solution as an iterative algorithm, then a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Image Processing
سال: 2009
ISSN: 1057-7149,1941-0042
DOI: 10.1109/tip.2009.2017823